Design and implementation of move-based heuristics for VLSI hypergraph partitioning
نویسندگان
چکیده
منابع مشابه
Unimodular Hypergraph based clustering approaches for VLSI Circuit Partitioning
The reliability of Integrated circuits mainly depends on the VLSI Design Automation techniques. The main problem faced in these techniques is the Physical Design Implementation. The size and performance parameters of an integrated circuit mainly rely on the three main domains of Physical Design which are Placement, Partitioning, and Routing. In this paper, the problem domain is expressed in Uni...
متن کاملGeneral iterative heuristics for VLSI multiobjective partitioning
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI has been a hot issue in recent years. In VLSI circuit partitioning, the problem of obtaining a minimum cut is of prime importance. With current trends, partitioning with multiple objectives which includes power, delay...
متن کاملMultilevel hypergraph partitioning: applications in VLSI domain
In this paper, we present a new hypergraph partitioning algorithm that is based on the multilevel paradigm. In the multilevel paradigm, a sequence of successively coarser hypergraphs is constructed. A bisection of the smallest hypergraph is computed and it is used to obtain a bisection of the original hypergraph by successively projecting and refining the bisection to the next level finer hyper...
متن کاملHypergraph partitioning with fixed vertices [VLSI CAD]
We empirically assess the implications of fixed terminals for hypergraph partitioning heuristics. Our experimental testbed incorporates a leading-edge multilevel hypergraph partitioner and IBM-internal circuits that have recently been released as part of the ISPD-98 Benchmark Suite. We find that the presence of fixed terminals can make a partitioning instance considerably easier (possibly to th...
متن کاملDesign and implementation of move-based partitioners
In this report we develop the idea that metaheuristics for VLSI move-based partitioning, such as Kernighan-Lin passes and simulated annealing, can be built from several reusable components with well-de ned interfaces and clear implementation options. For example, the classic net-cut bipartitioning algorithm by Fiduccia and Mattheyses can be structured for e cient implementation with many explic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2000
ISSN: 1084-6654,1084-6654
DOI: 10.1145/351827.384247